package edu.whu.rose.clock.kps.spindex;

public class ShortestPathIndexItem {

	private int[] distances;
	private int[] predecessors;
	
	public ShortestPathIndexItem(int[] distances, int[] predecessors) {
		super();
		this.distances = distances;
		this.predecessors = predecessors;
	}
	
	public int size() {
		return distances.length;
	}

	public int[] getDistances() {
		return distances;
	}

	public int[] getPredecessors() {
		return predecessors;
	}
	
}
